Optimal codes for correcting single errors and detecting adjacent errors
نویسنده
چکیده
Optimal codes that correct single errors and detect double errors within nibbles of power of two length are presented. For each n, a code of length n, with the largest possible dimension which corrects single errors and detects double adjacent errors is presented. The problem of constructing optimal codes, which correct single errors and detect double adjacent errors within nibbles of length 1 is discussed.
منابع مشابه
An approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملHardware Implementation of Single Bit Error Correction and Double Bit Error Detection through Selective Bit Placement for Memory
Hamming codes are widely used for the single bit error correction double bit error detection (SEC-DED) which occurred during data transmission process. This paper presents an enhanced detection of double adjacent bit errors and correcting all possible single bit errors in Hamming codes through selective bit placement technique for memory application. Soft errors occur due to the radiation parti...
متن کاملA Systematic (12, 8) Code for Correcting Single Errors and Detecting Adjacent Errors
Schwartz and Wolf give a parity check matrix for a systematic (12,8) binary code that corrects all single errors and detects eight of the nine double adjacent errors within any of the three 4-bit nibbles. Here, we present a parity check matrix for a systematic (12,8) binary code that corrects all single errors and detects any pair of errors within a nibble. nibble, parity-check matrix, systemat...
متن کاملError and erasure control (d, k) block codes
New combinatorial and algebraic techniques are presented for systematically constructing different (d,k) block codes capable of detecting and correcting single bit-errors, single-peak shift-errors, double adjacent-errors and multiple adjacent erasures. Constructions utilizing channel side information, such as the magnetic recording ternary channel output string, or erasures, do not impose any r...
متن کاملOptimal codes for single-error correction, double-adjacent-error detection
In certain memory systems the most common error is a single error and the next most common error is two errors in positions which are stored physically adjacent in the memory. In this correspondence we present optimal codes for recovering from such errors. We correct single errors and detect double adjacent errors. For detecting adjacent errors we consider codes which are byte-organized. In the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 38 شماره
صفحات -
تاریخ انتشار 1992